TSTP Solution File: CSR130^2 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : CSR130^2 : TPTP v8.1.2. Released v4.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n009.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Sat May 4 07:34:35 EDT 2024
% Result : Theorem 0.21s 0.51s
% Output : CNFRefutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 14
% Syntax : Number of formulae : 40 ( 6 unt; 9 typ; 0 def)
% Number of atoms : 111 ( 0 equ; 0 cnn)
% Maximal formula atoms : 12 ( 3 avg)
% Number of connectives : 391 ( 61 ~; 53 |; 24 &; 251 @)
% ( 0 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 18 ( 6 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 23 ( 23 >; 0 *; 0 +; 0 <<)
% Number of symbols : 11 ( 9 usr; 6 con; 0-2 aty)
% Number of variables : 27 ( 0 ^ 25 !; 2 ?; 27 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_28,type,
holdsDuring_THFTYPE_IiooI: $i > $o > $o ).
thf(decl_37,type,
lBill_THFTYPE_i: $i ).
thf(decl_42,type,
lMary_THFTYPE_i: $i ).
thf(decl_45,type,
lSue_THFTYPE_i: $i ).
thf(decl_52,type,
lYearFn_THFTYPE_IiiI: $i > $i ).
thf(decl_53,type,
likes_THFTYPE_IiioI: $i > $i > $o ).
thf(decl_57,type,
n2009_THFTYPE_i: $i ).
thf(decl_68,type,
esk1_1: ( $i > $i > $o ) > $i ).
thf(decl_69,type,
esk2_1: ( $i > $i > $o ) > $i ).
thf(con,conjecture,
? [X33: $i > $i > $o] :
( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i )
@ ( ( X33 @ lSue_THFTYPE_i @ lBill_THFTYPE_i )
& ( X33 @ lMary_THFTYPE_i @ lBill_THFTYPE_i )
& ~ ! [X34: $i,X35: $i] : ( X33 @ X34 @ X35 ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.lbHzM8eqd6/E---3.1_15235.p',con) ).
thf(ax_005,axiom,
holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ ( likes_THFTYPE_IiioI @ lMary_THFTYPE_i @ lBill_THFTYPE_i ),
file('/export/starexec/sandbox2/tmp/tmp.lbHzM8eqd6/E---3.1_15235.p',ax_005) ).
thf(ax_011,axiom,
! [X13: $i,X14: $o] :
( ( holdsDuring_THFTYPE_IiooI @ X13 @ ~ X14 )
=> ~ ( holdsDuring_THFTYPE_IiooI @ X13 @ X14 ) ),
file('/export/starexec/sandbox2/tmp/tmp.lbHzM8eqd6/E---3.1_15235.p',ax_011) ).
thf(ax_003,axiom,
holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ lBill_THFTYPE_i ),
file('/export/starexec/sandbox2/tmp/tmp.lbHzM8eqd6/E---3.1_15235.p',ax_003) ).
thf(ax_008,axiom,
( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i )
@ ~ ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ lMary_THFTYPE_i ) ),
file('/export/starexec/sandbox2/tmp/tmp.lbHzM8eqd6/E---3.1_15235.p',ax_008) ).
thf(c_0_5,negated_conjecture,
~ ? [X33: $i > $i > $o] :
( ( ~ ( ( X33 @ lSue_THFTYPE_i @ lBill_THFTYPE_i )
& ( X33 @ lMary_THFTYPE_i @ lBill_THFTYPE_i )
& ~ ! [X34: $i,X35: $i] : ( X33 @ X34 @ X35 ) )
| ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ $true ) )
& ( ( ( X33 @ lSue_THFTYPE_i @ lBill_THFTYPE_i )
& ( X33 @ lMary_THFTYPE_i @ lBill_THFTYPE_i )
& ~ ! [X34: $i,X35: $i] : ( X33 @ X34 @ X35 ) )
| ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ $false ) ) ),
inference(fool_unroll,[status(thm)],[inference(assume_negation,[status(cth)],[con])]) ).
thf(c_0_6,axiom,
( ( ~ ( likes_THFTYPE_IiioI @ lMary_THFTYPE_i @ lBill_THFTYPE_i )
| ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ $true ) )
& ( ( likes_THFTYPE_IiioI @ lMary_THFTYPE_i @ lBill_THFTYPE_i )
| ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ $false ) ) ),
inference(fool_unroll,[status(thm)],[ax_005]) ).
thf(c_0_7,negated_conjecture,
! [X39: $i > $i > $o,X42: $i,X43: $i] :
( ( ~ ( X39 @ lSue_THFTYPE_i @ lBill_THFTYPE_i )
| ~ ( X39 @ lMary_THFTYPE_i @ lBill_THFTYPE_i )
| ( X39 @ X42 @ X43 )
| ( X39 @ lSue_THFTYPE_i @ lBill_THFTYPE_i ) )
& ( ~ ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ $false )
| ( X39 @ lSue_THFTYPE_i @ lBill_THFTYPE_i ) )
& ( ~ ( X39 @ lSue_THFTYPE_i @ lBill_THFTYPE_i )
| ~ ( X39 @ lMary_THFTYPE_i @ lBill_THFTYPE_i )
| ( X39 @ X42 @ X43 )
| ( X39 @ lMary_THFTYPE_i @ lBill_THFTYPE_i ) )
& ( ~ ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ $false )
| ( X39 @ lMary_THFTYPE_i @ lBill_THFTYPE_i ) )
& ( ~ ( X39 @ lSue_THFTYPE_i @ lBill_THFTYPE_i )
| ~ ( X39 @ lMary_THFTYPE_i @ lBill_THFTYPE_i )
| ( X39 @ X42 @ X43 )
| ~ ( X39 @ ( esk1_1 @ X39 ) @ ( esk2_1 @ X39 ) ) )
& ( ~ ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ $false )
| ~ ( X39 @ ( esk1_1 @ X39 ) @ ( esk2_1 @ X39 ) ) )
& ( ~ ( X39 @ lSue_THFTYPE_i @ lBill_THFTYPE_i )
| ~ ( X39 @ lMary_THFTYPE_i @ lBill_THFTYPE_i )
| ( X39 @ X42 @ X43 )
| ~ ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ $true ) )
& ( ~ ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ $false )
| ~ ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ $true ) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_5])])])])])]) ).
thf(c_0_8,plain,
( ( ~ ( likes_THFTYPE_IiioI @ lMary_THFTYPE_i @ lBill_THFTYPE_i )
| ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ $true ) )
& ( ( likes_THFTYPE_IiioI @ lMary_THFTYPE_i @ lBill_THFTYPE_i )
| ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ $false ) ) ),
inference(fof_nnf,[status(thm)],[c_0_6]) ).
thf(c_0_9,plain,
! [X13: $i,X14: $o] :
( ( ( X14
| ( holdsDuring_THFTYPE_IiooI @ X13 @ $true ) )
& ( ~ X14
| ( holdsDuring_THFTYPE_IiooI @ X13 @ $false ) ) )
=> ~ ( holdsDuring_THFTYPE_IiooI @ X13 @ X14 ) ),
inference(fof_simplification,[status(thm)],[inference(fool_unroll,[status(thm)],[ax_011])]) ).
thf(c_0_10,axiom,
( ( ~ ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ lBill_THFTYPE_i )
| ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ $true ) )
& ( ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ lBill_THFTYPE_i )
| ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ $false ) ) ),
inference(fool_unroll,[status(thm)],[ax_003]) ).
thf(c_0_11,plain,
( ( ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ lMary_THFTYPE_i )
| ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ $true ) )
& ( ~ ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ lMary_THFTYPE_i )
| ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ $false ) ) ),
inference(fof_simplification,[status(thm)],[inference(fool_unroll,[status(thm)],[ax_008])]) ).
thf(c_0_12,negated_conjecture,
! [X33: $i > $i > $o] :
( ( X33 @ lMary_THFTYPE_i @ lBill_THFTYPE_i )
| ~ ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ ~ $true ) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
thf(c_0_13,plain,
( ( likes_THFTYPE_IiioI @ lMary_THFTYPE_i @ lBill_THFTYPE_i )
| ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ ~ $true ) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
thf(c_0_14,plain,
! [X44: $i,X45: $o] :
( ( X45
| ~ X45
| ~ ( holdsDuring_THFTYPE_IiooI @ X44 @ X45 ) )
& ( ~ ( holdsDuring_THFTYPE_IiooI @ X44 @ $false )
| ~ X45
| ~ ( holdsDuring_THFTYPE_IiooI @ X44 @ X45 ) )
& ( X45
| ~ ( holdsDuring_THFTYPE_IiooI @ X44 @ $true )
| ~ ( holdsDuring_THFTYPE_IiooI @ X44 @ X45 ) )
& ( ~ ( holdsDuring_THFTYPE_IiooI @ X44 @ $false )
| ~ ( holdsDuring_THFTYPE_IiooI @ X44 @ $true )
| ~ ( holdsDuring_THFTYPE_IiooI @ X44 @ X45 ) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_9])])])]) ).
thf(c_0_15,plain,
( ( ~ ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ lBill_THFTYPE_i )
| ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ $true ) )
& ( ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ lBill_THFTYPE_i )
| ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ $false ) ) ),
inference(fof_nnf,[status(thm)],[c_0_10]) ).
thf(c_0_16,plain,
( ( ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ lMary_THFTYPE_i )
| ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ $true ) )
& ( ~ ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ lMary_THFTYPE_i )
| ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ $false ) ) ),
inference(fof_nnf,[status(thm)],[c_0_11]) ).
thf(c_0_17,plain,
( ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ $true )
| ~ ( likes_THFTYPE_IiioI @ lMary_THFTYPE_i @ lBill_THFTYPE_i ) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
thf(c_0_18,negated_conjecture,
likes_THFTYPE_IiioI @ lMary_THFTYPE_i @ lBill_THFTYPE_i,
inference(condense,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_13])]) ).
thf(c_0_19,plain,
! [X1: $i] :
( ~ ( holdsDuring_THFTYPE_IiooI @ X1 @ $true )
| ~ ( holdsDuring_THFTYPE_IiooI @ X1 @ ~ $true ) ),
inference(cn,[status(thm)],[inference(cn,[status(thm)],[inference(split_conjunct,[status(thm)],[c_0_14])])]) ).
thf(c_0_20,plain,
( ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ lBill_THFTYPE_i )
| ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ ~ $true ) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
thf(c_0_21,plain,
( ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ ~ $true )
| ~ ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ lMary_THFTYPE_i ) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
thf(c_0_22,negated_conjecture,
! [X1: $i,X2: $i,X33: $i > $i > $o] :
( ( X33 @ X1 @ X2 )
| ~ ( X33 @ lSue_THFTYPE_i @ lBill_THFTYPE_i )
| ~ ( X33 @ lMary_THFTYPE_i @ lBill_THFTYPE_i )
| ~ ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ $true ) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
thf(c_0_23,plain,
holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ $true,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_17,c_0_18])]) ).
thf(c_0_24,plain,
( ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ lBill_THFTYPE_i )
| ~ ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ $true ) ),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
thf(c_0_25,plain,
( ~ ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ $true )
| ~ ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ lMary_THFTYPE_i ) ),
inference(spm,[status(thm)],[c_0_19,c_0_21]) ).
thf(c_0_26,negated_conjecture,
! [X1: $i,X2: $i,X33: $i > $i > $o] :
( ( X33 @ X1 @ X2 )
| ~ ( X33 @ lMary_THFTYPE_i @ lBill_THFTYPE_i )
| ~ ( X33 @ lSue_THFTYPE_i @ lBill_THFTYPE_i ) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_22,c_0_23])]) ).
thf(c_0_27,plain,
likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ lBill_THFTYPE_i,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_24,c_0_23])]) ).
thf(c_0_28,plain,
~ ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ lMary_THFTYPE_i ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_25,c_0_23])]) ).
thf(c_0_29,negated_conjecture,
! [X1: $i,X2: $i] : ( likes_THFTYPE_IiioI @ X1 @ X2 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_27]),c_0_18])]) ).
thf(c_0_30,plain,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_28,c_0_29])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : CSR130^2 : TPTP v8.1.2. Released v4.1.0.
% 0.07/0.14 % Command : run_E %s %d THM
% 0.15/0.35 % Computer : n009.cluster.edu
% 0.15/0.35 % Model : x86_64 x86_64
% 0.15/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.35 % Memory : 8042.1875MB
% 0.15/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.35 % CPULimit : 300
% 0.15/0.35 % WCLimit : 300
% 0.15/0.35 % DateTime : Fri May 3 14:27:23 EDT 2024
% 0.15/0.35 % CPUTime :
% 0.21/0.49 Running higher-order theorem proving
% 0.21/0.49 Running: /export/starexec/sandbox2/solver/bin/eprover-ho --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=300 /export/starexec/sandbox2/tmp/tmp.lbHzM8eqd6/E---3.1_15235.p
% 0.21/0.51 # Version: 3.1.0-ho
% 0.21/0.51 # Preprocessing class: HSLSSMSMSSSNSSA.
% 0.21/0.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.51 # Starting new_ho_10_unif with 1500s (5) cores
% 0.21/0.51 # Starting sh3l with 300s (1) cores
% 0.21/0.51 # Starting new_ho_6 with 300s (1) cores
% 0.21/0.51 # Starting lpo6_lambda_fix with 300s (1) cores
% 0.21/0.51 # sh3l with pid 15314 completed with status 0
% 0.21/0.51 # Result found by sh3l
% 0.21/0.51 # Preprocessing class: HSLSSMSMSSSNSSA.
% 0.21/0.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.51 # Starting new_ho_10_unif with 1500s (5) cores
% 0.21/0.51 # Starting sh3l with 300s (1) cores
% 0.21/0.51 # SinE strategy is gf120_gu_RUU_F100_L01000
% 0.21/0.51 # Search class: HGHNF-FFSM11-SSSFFSBN
% 0.21/0.51 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.21/0.51 # Starting new_ho_10 with 163s (1) cores
% 0.21/0.51 # new_ho_10 with pid 15317 completed with status 0
% 0.21/0.51 # Result found by new_ho_10
% 0.21/0.51 # Preprocessing class: HSLSSMSMSSSNSSA.
% 0.21/0.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.51 # Starting new_ho_10_unif with 1500s (5) cores
% 0.21/0.51 # Starting sh3l with 300s (1) cores
% 0.21/0.51 # SinE strategy is gf120_gu_RUU_F100_L01000
% 0.21/0.51 # Search class: HGHNF-FFSM11-SSSFFSBN
% 0.21/0.51 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.21/0.51 # Starting new_ho_10 with 163s (1) cores
% 0.21/0.51 # Preprocessing time : 0.002 s
% 0.21/0.51 # Presaturation interreduction done
% 0.21/0.51
% 0.21/0.51 # Proof found!
% 0.21/0.51 # SZS status Theorem
% 0.21/0.51 # SZS output start CNFRefutation
% See solution above
% 0.21/0.51 # Parsed axioms : 112
% 0.21/0.51 # Removed by relevancy pruning/SinE : 104
% 0.21/0.51 # Initial clauses : 24
% 0.21/0.51 # Removed in clause preprocessing : 3
% 0.21/0.51 # Initial clauses in saturation : 21
% 0.21/0.51 # Processed clauses : 46
% 0.21/0.51 # ...of these trivial : 0
% 0.21/0.51 # ...subsumed : 8
% 0.21/0.51 # ...remaining for further processing : 38
% 0.21/0.51 # Other redundant clauses eliminated : 0
% 0.21/0.51 # Clauses deleted for lack of memory : 0
% 0.21/0.51 # Backward-subsumed : 8
% 0.21/0.51 # Backward-rewritten : 11
% 0.21/0.51 # Generated clauses : 24
% 0.21/0.51 # ...of the previous two non-redundant : 23
% 0.21/0.51 # ...aggressively subsumed : 0
% 0.21/0.51 # Contextual simplify-reflections : 0
% 0.21/0.51 # Paramodulations : 24
% 0.21/0.51 # Factorizations : 0
% 0.21/0.51 # NegExts : 0
% 0.21/0.51 # Equation resolutions : 0
% 0.21/0.51 # Disequality decompositions : 0
% 0.21/0.51 # Total rewrite steps : 12
% 0.21/0.51 # ...of those cached : 6
% 0.21/0.51 # Propositional unsat checks : 0
% 0.21/0.51 # Propositional check models : 0
% 0.21/0.51 # Propositional check unsatisfiable : 0
% 0.21/0.51 # Propositional clauses : 0
% 0.21/0.51 # Propositional clauses after purity: 0
% 0.21/0.51 # Propositional unsat core size : 0
% 0.21/0.51 # Propositional preprocessing time : 0.000
% 0.21/0.51 # Propositional encoding time : 0.000
% 0.21/0.51 # Propositional solver time : 0.000
% 0.21/0.51 # Success case prop preproc time : 0.000
% 0.21/0.51 # Success case prop encoding time : 0.000
% 0.21/0.51 # Success case prop solver time : 0.000
% 0.21/0.51 # Current number of processed clauses : 7
% 0.21/0.51 # Positive orientable unit clauses : 2
% 0.21/0.51 # Positive unorientable unit clauses: 0
% 0.21/0.51 # Negative unit clauses : 0
% 0.21/0.51 # Non-unit-clauses : 5
% 0.21/0.51 # Current number of unprocessed clauses: 10
% 0.21/0.51 # ...number of literals in the above : 26
% 0.21/0.51 # Current number of archived formulas : 0
% 0.21/0.51 # Current number of archived clauses : 31
% 0.21/0.51 # Clause-clause subsumption calls (NU) : 17
% 0.21/0.51 # Rec. Clause-clause subsumption calls : 17
% 0.21/0.51 # Non-unit clause-clause subsumptions : 11
% 0.21/0.51 # Unit Clause-clause subsumption calls : 8
% 0.21/0.51 # Rewrite failures with RHS unbound : 0
% 0.21/0.51 # BW rewrite match attempts : 6
% 0.21/0.51 # BW rewrite match successes : 6
% 0.21/0.51 # Condensation attempts : 46
% 0.21/0.51 # Condensation successes : 2
% 0.21/0.51 # Termbank termtop insertions : 2364
% 0.21/0.51 # Search garbage collected termcells : 481
% 0.21/0.51
% 0.21/0.51 # -------------------------------------------------
% 0.21/0.51 # User time : 0.005 s
% 0.21/0.51 # System time : 0.004 s
% 0.21/0.51 # Total time : 0.009 s
% 0.21/0.51 # Maximum resident set size: 1940 pages
% 0.21/0.51
% 0.21/0.51 # -------------------------------------------------
% 0.21/0.51 # User time : 0.008 s
% 0.21/0.51 # System time : 0.006 s
% 0.21/0.51 # Total time : 0.014 s
% 0.21/0.51 # Maximum resident set size: 1812 pages
% 0.21/0.51 % E---3.1 exiting
% 0.21/0.52 % E exiting
%------------------------------------------------------------------------------